Deterministic list codes for state-constrained arbitrarily varying channels

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Abstract The capacity for the discrete memoryless arbitrarily varying channel (AVC) with cost constraints on the jammer is studied using deterministic list codes under both the maximal and average probability of error criteria. For a cost function l(·) on the state set and constraint Λ on the jammer, the achievable rates are upper bounded by the random coding capacity C r (Λ). For maximal error, the rate R = C r (Λ) − ǫ is achievable using list codes with list size O(ǫ −1). For average error, an integer L sym (Λ), called the symmetrizability, is defined. It is shown that any rate below C r (Λ) is achievable under average error using list codes of list size L > L sym. An example is given for a class of discrete additive AVCs.